package gold.digger;

import java.util.*;
import java.util.List;

/**
 * Created by fanzhenyu02 on 2020/6/27.
 * common problem solver template.
 */
public class LC706 {
    public long startExecuteTime = System.currentTimeMillis();


    class MyHashMap {
        int INF = Integer.MAX_VALUE;
        int N = 1000009;
        int[] map = new int[N];

        public MyHashMap() {
            Arrays.fill(map, INF);
        }

        public void put(int key, int value) {
            map[key] = value;
        }

        public int get(int key) {
            return map[key] == INF ? -1 : map[key];
        }

        public void remove(int key) {
            map[key] = INF;
        }
    }


    public void run() {
        MyHashMap solution = new MyHashMap();
        List<Integer> list = new ArrayList<>();
        System.out.println(solution.toString());
    }

    public static void main(String[] args) throws Exception {
        LC706 an = new LC706();
        an.run();

        System.out.println("\ncurrent solution total execute time: " + (System.currentTimeMillis() - an.startExecuteTime) + " ms.");
    }
}
